VLIW processor and method therefor

ABSTRACT

A computing system as described in which individual instructions are executable in parallel by processing pipelines, and instructions to be executed in parallel by different pipelines are supplied to the pipelines simultaneously. The system includes storage for storing an arbitrary number of the instructions to be executed. The instructions to be executed are tagged with pipeline identification tags indicative of the pipeline to which they should be dispatched. The pipeline identification tags are supplied to a system which controls a crossbar switch, enabling the tags to be used to control the switch and supply the appropriate instructions simultaneously to the differing pipelines.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation of U.S. application Ser. No. 08/754,337 filed Nov. 22, 1996, now U.S. Pat. No. 5,794,003; which is a continuation of U.S. application Ser. No. 08/498,135, filed Jul. 5, 1995, now abandoned, which is a continuation of U.S. application Ser. No. 08/147,797 filed Nov. 5, 1993, now abandoned.

BACKGROUND OF THE INVENTION

This invention relates to the architecture of computing systems, and in particular to an architecture in which individual instructions may be executed in parallel, as well as to methods and apparatus for accomplishing that.

A common goal in the design of computer architectures is to increase the speed of execution of a given set of instructions. One approach to increasing instruction execution rates is to issue more than one instruction per clock cycle, in other words, to issue instructions in parallel. This allows the instruction execution rate to exceed the clock rate. Computing systems that issue multiple independent instructions during each clock cycle must solve the problem of routing the individual instructions that are dispatched in parallel to their respective execution units. One mechanism used to achieve this parallel routing of instructions is generally called a “crossbar switch.”

In present state of the art computers, e.g. the Digital Equipment Alpha, the Sun Microsystems SuperSparc, and the Intel Pentium, the crossbar switch is implemented as part of the instruction pipeline. In these machines the crossbar is placed between the instruction decode and instruction execute stages. This is because the conventional approach requires the instructions to be decoded before it is possible to determine the pipeline to which they should be dispatched. Unfortunately, decoding in this manner slows system speed and requires extra surface area on the integrated circuit upon which the processor is formed. These disadvantages are explained further below.

This invention relates to the architecture of computing systems, and in particular to an architecture in which groups of instructions may be executed in parallel, as well as to methods and apparatus for accomplishing that.

A common goal in the design of computer architectures is to increase the speed of execution of a given set of instructions. Many solutions have been proposed for this problem, and these solutions generally can be divided into two groups.

According to a first approach, the speed of execution of individual instructions is increased by using techniques directed to decreasing the time required to execute a group of instructions serially. Such techniques include employing simple fixed-width instructions, pipelined execution units, separate instruction and data caches, increasing the clock rate of the instruction processor, employing a reduced set of instructions, using branch prediction techniques, and the like. As a result it is now possible to reduce the number of clocks to execute an instruction to approximately one. Thus, in these approaches, the instruction execution rate is limited to the clock speed for the system.

To push the limits of instruction execution to higher levels, a second approach is to issue more than one instruction per clock cycle, in other words, to issue instructions in parallel. This allows the instruction execution rate to exceed the clock rate. There are two classical approaches to parallel execution of instructions.

Computing systems that fetch and examine several instructions simultaneously to find parallelism in existing instruction streams to determine if any can be issued together are known as superscaler computing systems. In a conventional superscaler system, a small number of independent instructions are issued in each clock cycle. Techniques are provided, however, to prevent more than one instruction from issuing if the instructions fetched are dependent upon each other or do not meet other special criteria. There is a high hardware overhead associated with this hardware instruction scheduling process. Typical superscaler machines include the Intel i960CA, the IBM RIOS, the Intergraph Clipper C400, the Motorola 88110, the Sun SuperSparc, the Hewlett-Packard PA-RISC 7100, the DEC Alpha, and the Intel Pentium.

Many researchers have proposed techniques for superscaler multiple instruction issue. Agerwala, T., and J. Cocke[1987] “High Performance Reduced Instruction Set Processors,” IBM Tech. Rep. (March), proposed this approach and coined the name “superscaler.” IBM described a computing system based on these ideas, and now manufactures and sells that machine as the RS/6000 system. This system is capable of issuing up to four instructions per clock and is described in “The IBM RISC System/6000 Processor,” IBM J. of Res. & Develop. (January, 1990) 34:1.

The other classical approach to parallel instruction execution is to employ a “wide-word” or “very long instruction word” (VLIW) architecture. A VLIW machine requires a new instruction set architecture with a wide-word format. A VLIW format instruction is a long fixed-width instruction that encodes multiple concurrent operations. VLIW systems use multiple independent functional units. Instead of issuing multiple independent instructions to the units, a VLIW system combines the multiple operations into one very long instruction. For example, in a VLIW system, multiple integer operations, floating point operations, and memory references may be combined in a single “instruction.” Each VLIW instruction thus includes a set of fields, each of which is interpreted and supplied to an appropriate functional unit. Although the wide-word instructions are fetched and executed sequentially, because each word controls the entire breadth of the parallel execution hardware, highly parallel operation results. Wide-word machines have the advantage of scheduling parallel operation statically, when the instructions are compiled. The fixed width instruction word and its parallel hardware, however, are designed to fit the maximum parallelism that might be available in the code, and most of the time far less parallelism is available in the code. Thus for much of the execution time, most of the instruction bandwidth and the instruction memory are unused.

There is often a very limited amount of parallelism available in a randomly chosen sequence of instructions, especially if the functional units are pipelined. When the units are pipelined, operations being issued on a given clock cycle cannot depend upon the outcome of any of the previously issued operations already in the pipeline. Thus, to efficiently employ VLIW, many more parallel operations are required than the number of functional units.

Another disadvantage of VLIW architectures which results from the fixed number of slots in the very long instruction word for classes of instructions, is that a typical VLIW instruction will contain information in only a few of its fields. This is inefficient, requiring the system to be designed for a circumstance that occurs only rarely—a fully populated instruction word.

Another disadvantage of VLIW systems is the need to increase the amount of code. Whenever an instruction is not full, the unused functional units translate to wasted bits, no-ops, in the instruction coding. Thus useful memory and/or instruction cache space is filled with useless no-op instructions. In short, VLIW machines tend to be wasteful of memory space and memory bandwidth except for only a very limited class of programs.

The term VLIW was coined by J. A. Fisher and his colleagues in Fisher, J. A., J. R. Ellis, J. C. Ruttenberg, and A. Nicolau [1984], “Parallel Processing: A Smart Compiler and a Dumb Machine,” Proc. SIGPLAN Conf. on Compiler Construction (June), Palo Alto, Calif., 11-16. Such a machine was commercialized by Multiflow Corporation.

For a more detailed description of both superscaler and VLIW architectures, see Computer Architecture—a Quantitative Approach, John L. Hennessy and David A. Patterson, Morgan Kaufmann Publishers, 1990.

BRIEF SUMMARY OF THE INVENTION

We have developed a computing system architecture that enables instructions to be routed to an appropriate pipeline more quickly, at lower power, and with simpler circuitry than previously possible. This invention places the crossbar switch earlier in the pipeline, making it a part of the initial instruction fetch operation. This allows the crossbar to be a part of the cache itself, rather than a stage in the instruction pipeline. It also allows the crossbar to take advantage of circuit design parameters that are typical of regular memory structures rather than random logic. Such advantages include: lower switching voltages (200-300 milliamps rather than 3-5 volts); more compact design, and higher switching speeds. In addition, if the crossbar is placed in the cache, the need for many sense amplifiers is eliminated, reducing the circuitry required in the system as a whole.

To implement the crossbar switch, the instructions coming from the cache, or otherwise arriving at the switch, must be tagged or otherwise associated with a pipeline identifier to direct the instructions to the appropriate pipeline for execution. In other words, pipeline dispatch information must be available at the crossbar switch at instruction fetch time, before conventional instruction decode has occurred. There are several ways this capability can be satisfied: In one embodiment this system includes a mechanism that routes each instruction in a set of instructions to be executed in parallel to an appropriate pipeline, as determined by a pipeline tag applied to each instruction during compilation, or placed in a separate identifying instruction that accompanies the original instruction. Alternately the pipeline affiliation can be determined after compilation at the time that instructions are fetched from memory into the cache, using a special predecoder unit.

Thus, in one implementation, this system includes a register or other means, for example, the memory cells providing for storage of a line in the cache, for holding instructions to be executed in parallel. Each instruction has associated with it a pipeline identifier indicative of the pipeline to which that instruction is to be issued. A crossbar switch is provided which has a first set of connectors coupled to receive the instructions, and a second set of connectors coupled to the processing pipelines to which the instructions are to be dispatched for execution. Means are provided which are responsive to the pipeline identifiers of the individual instructions in the group supplied to the first set of connectors for routing those individual instructions onto appropriate paths of the second set of connectors, thereby supplying each instruction in the group to be executed in parallel to the appropriate pipeline.

In a preferred embodiment of this invention the associative crossbar is implemented in the instruction cache. By placing the crossbar in the cache all switching is done at low signal levels (approximately 200-300 millivolts). Switching at these low levels is substantially faster than switching at higher levels (5 volts) after the sense amplifiers. The lower power also eliminates the need for large driver circuits, and eliminates numerous sense amplifiers. Additionally by implementing the crossbar in the cache, the layout pitch of the crossbar lines matches the pitch of the layout of the cache.

We have developed a computing system architecture, which we term software-scheduled superscaler, which enables instructions to be executed both sequentially and in parallel, yet without wasting space in the instruction cache or registers. Like a wide-word machine, we provide for static scheduling of concurrent operations at program compilation. Instructions are also stored and loaded into fixed width frames (equal to the width of a cache line). Like a superscaler machine, however, we employ a traditional instruction set, in which each instruction encodes only one basic operation (load, store, etc.). We achieve concurrence by fetching and dispatching “groups” of simple individual instructions, arranged in any order. The architecture of our invention relies upon the compiler to assign instruction sequence codes to individual instructions at the time they are compiled. During execution these instruction sequence codes are used to sort the instructions into appropriate groups and execute them in the desired order. Thus our architecture does not suffer the high hardware overhead and run-time constraints of the superscaler strategy, nor does it suffer the wasted instruction bandwidth and memory typical of VLIW systems.

Our system includes a mechanism, an associative crossbar, which routes in parallel each instruction in an arbitrarily selected group to an appropriate pipeline, as determined by a pipeline tag applied to that instruction during compilation. Preferably, the pipeline tag will correspond to the type of functional unit required for execution of that instruction, e.g., floating point unit 1. All instructions in a selected group can be dispatched simultaneously.

Thus, in one implementation, our system includes a cache line, register, or other means for holding at least one group of instructions to be executed in parallel, each instruction in the group having associated therewith a pipeline identifier indicative of the pipeline for executing that instruction and a group identifier indicative of the group of instructions to be executed in parallel. The group identifier causes all instructions having the same group identifier to be executed simultaneously, while the pipeline identifier causes individual instructions in the group to be supplied to an appropriate pipeline.

In another embodiment the register holds multiple groups of instructions, and all of the instructions in each group having a common group identifier are placed next to each other, with the group of instructions to be executed first placed at one end of the register, and the instructions in the group to be executed last placed at the other end of the register.

In another embodiment of our invention a method of executing arbitrary numbers of instructions in a stream of instructions in parallel includes the steps of compiling the instructions to determine which instructions can be executed simultaneously, assigning group identifiers to sets of instructions that can be executed in parallel, determining a pipeline for execution of each instruction, assigning a pipeline identifier to each instruction, and placing the instructions in a cache line or register for execution by the pipelines.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a typical environment for a preferred implementation of this invention;

FIG. 2 is a diagram illustrating the data structure of an instruction word in this system;

FIG. 3 is a diagram illustrating a group of instruction words;

FIG. 4 is a diagram illustrating a frame containing from one to eight groups of instructions;

FIG. 5 a illustrates the frame structure for one maximum-sized group of eight instructions;

FIG. 5 b illustrates the frame structure for a typical mix of three intermediate sized group of instructions;

FIG. 5 c illustrates the frame structure for eight minimum-sized groups, each of one instruction;

FIG. 6 illustrates an instruction word after predecoding;

FIG. 7 illustrates the operation of the predecoder;

FIG. 8 is a diagram illustrating the overall structure of the instruction cache of FIG. 1;

FIG. 9 is a diagram illustrating the manner in which frames are selected from the instruction cache;

FIG. 10 is a diagram illustrating one embodiment of the associative crossbar and the group selection function in the associative crossbar;

FIG. 11 is a diagram illustrating the group dispatch function in the associative crossbar;

FIG. 12 is a diagram illustrating a hypothetical frame of instructions;

FIG. 13 is a diagram illustrating the manner in which the groups of instructions in FIG. 12 are issued on different clock cycles;

FIG. 14 is a diagram illustrating another embodiment of the associative crossbar;

FIG. 15 is a diagram illustrating the group select function in further detail; and

FIG. 16 is a diagram illustrating another embodiment of the associative crossbar.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a block diagram of a computer system incorporating the associative crossbar switch according to the preferred embodiment of this invention. The following briefly describes the overall preferred system environment within which the crossbar is incorporated. For additional information about the system, see copending U.S. patent application Ser. No. 08/147,800, filed Nov. 5, 1993, and entitled “Software Scheduled Superscaler Computer Architecture,” which is incorporated by reference herein. FIG. 1 illustrates the organization of the integrated circuit chips by which the computing system is formed. As depicted, the system includes a first integrated circuit 10 that includes a central processing unit, a floating point unit, and an instruction cache.

In the preferred embodiment the instruction cache is a 16 kilobyte two-way set-associative 32 byte line cache. A set associative cache is one in which the lines (or blocks) can be placed only in a restricted set of locations. The line is first mapped into a set, but can be placed anywhere within that set. In a two-way set associative cache, two sets, or compartments, are provided, and each line can be placed in one compartment or the other.

The system also includes a data cache chip 20 that comprises a 32 kilobyte four-way set-associative 32 byte line cache. The third chip 30 of the system includes a predecoder, a cache controller, and a memory controller. The predecoder and instruction cache are explained further below. For the purposes of this invention, the CPU, FPU, data cache, cache controller and memory controller all may be considered of conventional design.

The communication paths among the chips are illustrated by arrows in FIG. 1. As shown, the CPU/FPU and instruction cache chip communicates over a 32 bit wide bus 12 with the predecoder chip 30. The asterisk is used to indicate that these communications are multiplexed so that a 64 bit word is communicated in two cycles. Chip 10 also receives information over 64 bit wide buses 14, 16 from the data cache 20, and supplies information to the data cache 20 over three 32 bit wide buses 18. The predecoder decodes a 32 bit instruction received from the secondary cache into a 64 bit word, and supplies that 64 bit word to the instruction cache on chip 10.

The specific functions of the predecoder are described in much greater detail below; however, essentially it functions to decode a 32 bit instruction received from the secondary cache into a 64 bit word, and to supply that 64 bit word to the instruction cache on chip 10.

The cache controller on chip 30 is activated whenever a first level cache miss occurs. Then the cache controller either goes to main memory or to the secondary cache to fetch the needed information. In the preferred embodiment the secondary cache lines are 32 bytes and the cache has an 8 kilobyte page size.

The data cache chip 20 communicates with the cache controller chip 30 over another 32 bit wide bus. In addition, the cache controller chip 30 communicates over a 64 bit wide bus 32 with the DRAM memory, over a 128 bit wide bus 34 with a secondary cache, and over a 64 bit wide bus 36 to input/output devices.

As will be described further below, the system shown in FIG. 1 includes multiple pipelines able to operate in parallel on separate instructions which are dispatched to these parallel pipelines simultaneously. In one embodiment the parallel instructions have been identified by the compiler and tagged with a pipeline identification tag indicative of the specific pipeline to which that instruction should be dispatched.

As will be described, the system shown in FIG. 1 includes both conventional and novel features. The system includes multiple pipelines able to operate in parallel on separate instructions. The instructions that can be dispatched to these parallel pipelines simultaneously, in what we term “instruction groups,” have been identified by the compiler and tagged with a group identification tag. Thus, the group tag designates instructions that can be executed simultaneously. Instructions within the group are also tagged with a pipeline tag indicative of the specific pipeline to which that instruction should be dispatched. This operation is also performed by the compiler.

In this system, an arbitrary number of instructions can be executed in parallel. In one embodiment of this system the central processing unit includes eight functional units and is capable of executing eight instructions in parallel. These pipelines are designated using the digits 0 to 7. Also, for this explanation each instruction word is assumed to be 32 bits (4 bytes) long.

In this system, each group of instructions can contain an arbitrary number of instructions ordered in an arbitrary sequence. The only limitation is that all instructions in the group must be capable of simultaneous execution; e.g., there cannot be data dependency between instructions. The instruction groups are collected into larger sets and are organized into fixed width “frames” and stored. Each frame can contain a variable number of tightly packed instruction groups, depending upon the number of instructions in each group and on the width of the frame.

Below we describe this concept more fully, as well as describe a mechanism to route in parallel each instruction in an arbitrarily selected group to its appropriate pipeline, as determined by the pipeline tag of the instruction.

In the following description of the word, group, and frame concepts mentioned above, specific bit and byte widths are used for the word, group and frame. It should be appreciated that these widths are arbitrary, and can be varied as desired. None of the general mechanisms described for achieving the result of this invention depends upon the specific implementation.

In one embodiment of this system the central processing unit includes eight functional units and is capable of executing eight instructions in parallel. We designate these pipelines using the digits 0 to 7. Also, for this explanation each instruction word is 32 bits (4 bytes) long, with a bit, for example, the high order bit S being reserved as a flag for group identification. FIG. 2 therefore shows the general format of all instructions. As shown by FIG. 2, bits 0 to 30 represent the instruction, with the high order bit 31 reserved to flag groups of instructions, i.e., collections of instructions the compiler has determined may be executed in parallel.

FIG. 3 illustrates a group of instructions. A group of instructions consists of one to eight instructions (because there are eight pipelines in the preferred implementation) ordered in any arbitrary sequence; each of which can be dispatched to a different parallel pipeline simultaneously.

FIG. 4 illustrates the structure of an instruction frame. In the preferred embodiment an instruction frame is 32 bytes wide and can contain up to eight instruction groups, each comprising from one to eight instructions. This is explained further below.

When the instruction stream is compiled before execution, the compiler places instructions in the same group next to each other in any order within the group and then places that group in the frame. The instruction groups are ordered within the frame from left to right according to their issue sequence. That is, of the groups of instructions in the frame, the first group to issue is placed in the leftmost position, the second group to issue is placed in the next position to the right, etc. Thus, the last group of instructions to issue within that frame will be placed in the rightmost location in the frame. As explained, the group affiliation of all instructions in the same group is indicated by setting the S bit (bit 31 in FIG. 2) to the same value. This value toggles back and forth from 0 to 1 to 0, etc., between adjacent groups to thereby identify the groups. Thus, all instructions in the first group in a frame have the S bit set to 0, all instructions in the second group have the S bit set to 1, all instructions in the third group have the S bit set to 0, etc., for all groups of instructions in the frame.

To clarify the use of a frame, FIG. 5 illustrates three different frame structures for different hypothetical groups of instructions. In FIG. 5 a the frame structure for a group of eight instructions, all of which can be issued simultaneously, is shown. The instruction words are designated W0, W1, . . . , W7. The S bit for each one of the instruction words has been set to 0 by the compiler, thereby indicating that all eight instructions can be issued simultaneously.

FIG. 5 b illustrates the frame structure for a typical mixture of three intermediate sized groups of instructions. In FIG. 5 b these three groups of instructions are designated Group 0, Group 1 and Group 2. Shown at the left-hand side of FIG. 5 b is Group 0 that consists of two instruction words W0 and W1. The S bits for each of these instructions has been set to 0. Group 1 of instructions consists of three instruction words, W2, W3 and W4, each having the S bit set to 1. Finally, Group 2 consists of three instruction words, W5, W6 and W7, each having its S bit set to 0.

FIG. 5 c illustrates the frame structure for eight minimum sized groups, each consisting of a single instruction. Because each “group” of a single instruction must be issued before the next group, the S bits toggle in a sequence 01010101 as shown.

As briefly mentioned above, in the preferred embodiment the pipeline identifiers are associated with individual instructions in a set of instructions during compilation, and in the preferred embodiment the group identifiers are associated with individual instructions in a group during compilation. In the preferred embodiment, this is achieved by compiling the instructions to be executed using a well-known compiler technology. During the compilation, the instructions are checked for data dependencies, dependence upon previous branch instructions, or other conditions that preclude their execution in parallel with other instructions. These steps are performed using a well-known compiler. The result of the compilation is identification of a set or group of instructions which can be executed in parallel. The result of the compilation is a group identifier being associated with each instruction. It is not necessary that the group identifier be added to the instruction as a tag, as shown in the preferred embodiment and described further below. In an alternative approach, the group identifier is provided as a separate tag that is later associated with the instruction. This makes possible the execution of programs on our system, without need to revise the word width. In addition, in the preferred embodiment, the compiler determines the appropriate pipeline for execution of an individual instruction. This determination is essentially a determination of the type of instruction provided. For example, load instructions will be sent to the load pipeline, store instructions to the store pipeline, etc. The association of the instruction with the given pipeline can be achieved either by the compiler, or by later examination of the instruction itself, for example, during predecoding.

Referring again to FIG. 1, in normal operation the CPU will execute instructions from the instruction cache according to well-known principles. On an instruction cache miss, however, a set of instructions containing the instruction missed is transferred from the main memory into the secondary cache and then into the primary instruction cache, or from the secondary cache to the primary instruction cache, where it occupies one line of the instruction cache memory. Because instructions are only executed out of the instruction cache, all instructions ultimately undergo the following procedure.

At the time a frame is transferred into the instruction cache, the instruction word in that frame is predecoded by the predecoder 30 (FIG. 1), which as is explained below decodes the retrieved instruction into a full 64 bit word. As part of this predecoding the S bit of each instruction is expanded to a full 3 bit field 000, 001, . . . , 111, which provides the explicit binary group number of the instruction. In other words, the predecoder, by expanding the S bit to a three bit sequence explicitly provides information that the instruction group 000 must execute before instruction group 010, although both groups would have all instructions within the group have S bits set to 0. Because of the frame rules for sequencing groups, these group numbers correspond to the order of issue of the groups of instructions. Group 0 (000) will be issued first, Group 1 (001), if present, will be issued second, Group 2 (010) will be issued third. Ultimately, Group 7 (111), if present, will be issued last. At the time of predecoding of each instruction, the S value of the last word in the frame, which belongs to the last group in the frame to issue, is stored in the tag field for that line in the cache, along with the 19 bit real address and a valid bit. The valid bit is a bit that specifies whether the information in that line in the cache is valid. If the bit is not set to “valid,” there cannot be a match or “hit” on this address. The S value from the last instruction, which S value is stored in the tag field of the line in the cache, provides a “countdown” value that can be used to know when to increment to the next cache line.

At the time a group of instructions is transferred into the instruction cache, the instruction words are predecoded by the predecoder 30. As part of the predecoding process, a multiple bit field prefix is added to each instruction based upon a tag added to the instruction by the compiler. This prefix gives the explicit pipe number of the pipeline to which that instruction will be routed. Thus, at the time an instruction is supplied from the predecoder to the instruction cache, each instruction will have a pipeline identifier.

As another part of the predecoding process, a new 4 bit field prefix is added to each instruction giving the explicit pipe number of the pipeline to which that instruction will be routed. The use of four bits, rather than three allows the system to be later expanded with additional pipelines. Thus, at the time an instruction is supplied from the predecoder to the instruction cache, each instruction will have the format shown in FIG. 6. As shown by FIG. 6, bits 0 to 56 provide 57 bits for the instruction, bits 57, 58 and 59 form the full 3 bit S field, and bits 60-63 provide the 4 bit P field.

FIG. 7 illustrates the operation of the predecoder in transferring a frame from memory to the instruction cache. In the upper portion of FIG. 7, the frame is shown with a hypothetical four groups of instructions. The first group consists of a single instruction, the second group of three instructions, and each of the third and fourth groups of two instructions. As described, instruction is 32 bits in length and include an S bit to separate the groups. The predecoder decodes the instruction shown in the upper portion of FIG. 7 into the instruction shown in the lower portion of FIG. 7. As shown, the instructions are expanded to 64 bit length, with each instruction including a 4 bit identification of the pipeline to which the instruction is to be assigned, and the expanded group field to designate the groups of instructions that can be executed together. For illustration, hypothetical pipeline tags have been applied. Additionally, the predecoder examines each frame for the minimum number of clocks required to execute the frame, and that number is appended to the address tag 45 for the line. The address tag consists of bits provided for the real address for the line, 1 bit to designate the validity of the frame, and 3 bits to specify the minimum time in number of clock cycles, for that frame to issue. The number of clocks for the frame to issue is determined by the group identification number of the last word in the frame. At this stage, the entire frame shown in the lower portion of FIG. 7 is present in the instruction cache.

It may be desirable to implement the system of this invention on computer systems that already are in existence and therefore have instruction structures that have already been defined without available blank fields for the group information, pipeline information, or both. In this case, in another embodiment of this invention, the group and the pipeline identifier information is supplied on a different clock cycle, then combined with the instructions in the cache or placed in a separate smaller cache. Such an approach can be achieved by adding a “no-op” instruction with fields that identify which instructions are in which group, and identify the pipeline for execution of the instruction, or by supplying the information relating to the parallel instructions in another manner. It therefore should be appreciated that the manner in which the data, the instruction and pipeline identifier arrives at the crossbar to be processed is somewhat arbitrary. I use the word “associated” herein to designate the concept that the pipeline and group identifiers are not required to have a fixed relationship to the instruction words. That is, the pipeline and group identifiers need not be embedded within the instructions themselves by the compiler as shown in FIG. 7. Instead they may arrive from another means, or on a different cycle.

FIG. 8 is a simplified diagram illustrating the secondary cache, the predecoder, and the instruction cache. This Figure, as well as FIGS. 9, 10 and 11, are used to explain the manner in which the instructions tagged with the P and S fields are routed to their designated instruction pipelines.

In FIG. 8, for illustration, assume that groups of instructions to be executed in parallel, instruction frames, are fetched in a single transfer across a 256 bit (32 byte) wide path from a secondary cache 50 into the predecoder 60. As explained above, the predecoder expands each 32 bit instruction in the frame to its full 64 bit wide form and prefixes the pipeline “P” and S fields to the instruction. After predecoding the resulting set of instructions, 512 bit wide instruction, is transferred into the primary instruction cache 70. At the same time, a tag is placed into the tag field 74 for that line.

In the preferred embodiment the instruction cache operates as a conventional physically-addressed instruction cache. In the example depicted in FIG. 8, the instruction cache will contain 512 bit sets of instructions, fully-expanded instruction frames of eight instructions each, organized in two compartments of 256 lines.

Address sources for the instruction cache arrive at a multiplexer 80 that selects the next address to be fetched. Because preferably instructions are always machine words, the low order two address bits <1:0> of the 32 bit address field supplied to multiplexer 80 are discarded. These two bits designate byte and half-word boundaries. Of the remaining 30 bits, the next three low order address bits <4:2>, which designate a particular instruction word in the set, a frame, are sent directly via bus 81 to the associative crossbar (explained in conjunction with subsequent figures). The next low eight address bits <12:5> are supplied over bus 82 to the instruction cache 70 where they are used to select one of the 256 lines in the instruction cache. Finally, the remaining 19 bits of the virtual address <31:13> are sent to the translation lookaside buffer (TLB) 90. The TLB translates these bits into the high 19 bits of the physical address. The TLB then supplies them over bus 84 to the instruction cache. In the cache they are compared with the tag of the selected line, to determine if there is a “hit” or a “miss” in the instruction cache.

If there is a hit in the instruction cache, indicating that the addressed instruction is present in the cache, then the selected set of instructions, frame containing the addressed instruction is transferred across the 512 bit wide bus 73 into the associative crossbar 100. The associative crossbar 100 then dispatches the addressed instruction, with the other instructions in its group, if any, to the appropriate pipelines over buses 110, 111, . . . , 117. Preferably the bit lines from the memory cells storing or containing the bits of the instruction are themselves coupled to the associative crossbar. This eliminates the need for numerous sense amplifiers, and allows the crossbar to operate on the lower voltage swing information from the cache line directly, without the normally intervening driver circuitry to slow system operation.

FIG. 9 is a block diagram illustrating in more detail the frame selection process. As shown, bits <4:2> of the virtual address are supplied directly to the associative crossbar 100 over bus 81. Bus 81, as explained above will preferably include a pair of conductors, the bit lines, for each data bit in the field. Bits <12:5> supplied over bus 82 are used to select a line in the instruction cache. The remaining 19 bits, translated into the 19 high order bits <31:13> of physical address, are used to compare against the tags of the two selected lines (one from each compartment of the cache) to determine if there is a hit in either compartment. If there is a hit, the two 512 bit wide frames are supplied to multiplexer 120. The choice of which line is ultimately supplied to associative crossbar 100 depends upon the real address bits <31:13> that are compared by comparators 125. The output from comparators 125 thus selects the appropriate frame for transfer to the crossbar 100.

FIG. 10 illustrates in more detail the group select function of the associative crossbar. A 512 bit wide register 130, preferably formed by the SRAM cells in the instruction cache contains the frame of the instructions to be issued. For the purposes of illustration, register 130 is shown as containing a frame having three groups of instructions, with Group 0 including words W0, W1 and W2; Group 1 containing words W3, W4 and W5; and Group 2 containing words W6 and W7. For illustration, the instructions in Group 0 are to be dispatched to pipelines 1, 2 and 3; the instructions in Group 1 to pipelines 1, 3 and 6; and the instructions in Group 2 to pipelines 1 and 6. The three S bits (group identification field) of each instruction in the frame are brought out to an 8:1 multiplexer 140 over buses 131, 132, 133, . . . , 138. The S field of the next group of instructions to be executed is present in a 3 bit register 145. As shown in FIG. 10, the hypothetical contents of register 145 are 011. These bits have been loaded into register 145 using bus 81 described in conjunction with FIG. 9. Multiplexer 140 then compares the value in this register against the contents of the S field in each of the instruction words. If the two values match, the appropriate decoder 150 is enabled, permitting the instruction word to be processed on that clock cycle. If the values do not match, the decoder is disabled and the instruction words are not processed on that clock cycle. In the example depicted in FIG. 10, the contents of register 145 match the S field of the Group 1 instructions. The resulting output, supplied over bus 142, is communicated to S register 144 and then to the decoders via bus 146. The S register contents enable decoders 153, 154 and 155, all of which are in Group 001. As will be shown in FIG. 11, this will enable these instructions W3, W4 and W5 to be sent to the pipelines for processing.

FIG. 11 is a block diagram illustrating the group dispatching of the instructions in the group to be executed and illustrates in more detail one embodiment of the associative crossbar. The same registers are shown across the upper portion of FIG. 11 as in the lower portion of FIG. 10. A 512 bit wide register 130, which represents the memory cells in a line of the cache (or can be a physically separate register), contains at least the set of instructions capable of being issued. For the purposes of illustration, register 130 is shown as containing up to eight instruction words W0 to W7. Using means described in the copending application referred to above, the instructions have been sorted into groups for parallel execution. For illustration here, assume the instructions in Group 1 are to be dispatched to pipelines 1, 2 and 3; the instructions in Group 2 to pipelines 1, 3 and 6; and the instructions in Group 3 to pipelines 1 and 6. The decoder select signal enables only the appropriate set of instructions to be executed in parallel, essentially allowing register 130 to contain more than just one set of instructions. Of course, by only using register 130 only for one set of parallel instructions at a time, the decoder select signal is not needed.

As shown in FIG. 10, the crossbar switch itself consists of two sets of crossing pathways. In the horizontal direction are the pipeline pathways 180, 181, . . . , 187. In the vertical direction are the instruction word paths, 190, 191, . . . , 197. Each of these pipeline and instruction pathways is themselves a bus for transferring the instruction word. Each horizontal pipeline pathway is coupled to a pipeline execution unit 200, 201, 202, . . . , 207. Each of the vertical instruction word pathways 190, 191, . . . , 197 is coupled to an appropriate portion of register or cache line 130 (FIG. 10).

The decoders 170, 171, . . . , 177 associated with each instruction word pathway receive the 4 bit pipeline code from the instruction. Each decoder, for example decoder 170, provides eight 1 bit control lines as output. One of these control lines is associated with each pipeline pathway crossing of that instruction word pathway. Selection of a decoder as described with reference to FIG. 10 activates the output bit control line corresponding to that input pipe number. This signals the crossbar to close the switch between the word path associated with that decoder and the pipe path selected by that bit line. Establishing the cross connection between these two pathways causes a selected instruction word to flow into the selected pipeline. For example, decoder 173 has received the pipeline bits for word W3. Word W3 has associated with it pipeline path 1. The pipeline path 1 bits are decoded to activate switch 213 to supply instruction word W3 to pipeline execution unit 201 over pipeline path 181. In a similar manner, the identification of pipeline path 3 for decoder D4 activates switch 234 to supply instruction word W4 to pipeline path 3. Finally, the identification of pipeline 6 for word W5 in decoder D5 activates switch 265 to transfer instruction word W5 to pipeline execution unit 206 over pipeline pathway 186. Thus, instructions W3, W4 and W5 are executed by pipes 201, 203 and 206, respectively.

The pipeline processing units 200, 201, . . . , 207 shown in FIG. 11 can carry out desired operations. In a preferred embodiment of the invention, each of the eight pipelines first includes a sense amplifier to detect the state of the signals on the bit lines from the crossbar. In one embodiment the pipelines include first and second arithmetic logic units; first and second floating point units; first and second load units; a store unit and a control unit. The particular pipeline to which a given instruction word is dispatched will depend upon hardware constraints as well as data dependencies.

FIG. 12 is an example of a frame and how it will be executed by the pipeline processors 200-207 of FIG. 11. As shown in FIG. 12 the frame includes three groups of instructions. The first group, with group identification number 0, includes two instructions that can be executed by the arithmetic logic unit, a load instruction and a store instruction. Because all these instructions have been assigned the same group identification number by the compiler, all four instructions can execute in parallel. The second group of instructions consists of a single load instruction and two floating point instructions. Again, because each of these instructions has been assigned “Group 1,” all three instructions can be executed in parallel. Finally, the last instruction word in the frame is a branch instruction that, based upon the compiler's decision, must be executed last.

FIG. 13 illustrates the execution of the instructions in the frame shown in FIG. 12. As shown, during the first clock the Group 0 instructions execute, during the second clock the load and floating point instructions execute, and during the third clock the branch instruction executes. To prevent groups from being split across two instruction frames, an instruction frame may be only partially filled, where the last group is too large to fit entirely within the remaining space of the frame.

FIG. 14 is a diagram illustrating another embodiment of the associative crossbar. In FIG. 14 nine pipelines 0-8 are shown coupled to the crossbar. The three bit program counter PC points to one of the instructions in the frame, in combination with the set of 8 group identification bits for the frame, indicating the group affiliation of each instruction, are used to enable a subset of the instructions in the frame. The decode select is used to enable a subset of the instructions in the register 130 for execution just as in the system of FIG. 11. The enabled instructions are those at or above the address indicated by the PC that belong to the current group.

The execution ports that connect to the pipelines specified by the pipeline identification bits of the enabled instructions are then selected to multiplex out the appropriate instructions from the current frame contents of the register. If one or more of the pipelines is not ready to receive a new instruction, a set of hold latches at the output of the execution ports prevents any of the enabled instructions from issuing until the “busy” pipeline is free. Otherwise the instructions pass transparently through the hold latches into their respective pipelines. Accompanying the output of each port is a “port valid” signal that indicates whether the port has valid information to issue to the hold latch.

FIG. 15 is a diagram illustrating the group select function in further detail. This figure illustrates the mechanism used to enable an addressed group of instructions within a frame. The program counter is first decoded into a set of 14 bit signals. Seven of these signals are combined with the eight group identifiers of the current frame to determine whether each of the seven instructions, 11 to 17, is or is not the start of a later group. This information can then be combined with the other 7 bit signals from the PC decoder to determine which of the eight instructions in the frame should be enabled. Using the pipeline identifying field each enabled instruction can be combined with the other 7 bit signal to determine which of the eight instructions in the frame should be enabled. Each such enabled instruction can then signal the execution port, as determined by the pipeline identifier, to multiplex out the enabled instruction. Thus if I2 is enabled, and the pipeline code is 5, the select line from I2 to port 5 is activated, causing I2 to flow to the hold latch at pipe 5.

Because the instructions that start later groups are known, the system can decide easily which instruction starts the next group. This information is used to update the PC to the address of the next group of instructions. If no instruction in the frame begins the next group, i.e., the last instruction group has been dispatched to the pipelines, a flag is set. The flag causes the next frame of instructions to be brought into the crossbar. The PC is then reset to I0. Shown in the figure is an exemplary sequence of the values that the PC, the instruction enable bits and the next frame flag take on over a sequence of eight clocks extending over two frames.

FIG. 16 illustrates an alternate embodiment for the invention where pipeline tags are not included with the instruction, but are supplied separately, or where the cache line itself is used as the register for the crossbar. In these situations, the pipeline tags may be placed into a high speed separate cache memory 200. The output from this memory can then control the crossbar in the same manner as described in conjunction with FIG. 10. This approach eliminates the need for sense amplifiers between the instruction cache and the crossbar. This enables the crossbar to switch very low voltage signals more quickly than higher level signals, and the need for hundreds of sense amplifiers is eliminated. To provide a higher level signal for control of the crossbar, sense amplifier 205 is placed between the pipeline tag cache 200 and the crossbar 100. Because the pipeline tag cache is a relatively small memory, however, it can operate more quickly than the instruction cache memory, and the tags therefore are available in time to control the crossbar despite the sense amplifier between the cache 200 and the crossbar 100. Once the switching occurs in the crossbar, then the signals are amplified by sense amplifiers 210 before being supplied to the various pipelines for execution.

The processor architecture described above provides many unique advantages to a system using this crossbar. The system and the crossbar described is extremely flexible, enabling instructions to be executed sequentially or in parallel, depending entirely upon the “intelligence” of the compiler. As compiler technology improves, the described hardware can execute programs more rapidly, not being limited to any particular frame width, number of instructions capable of parallel execution, or other external constraints. Importantly, the associative crossbar relies upon the content of the message being decoded, not upon an external control circuit acting independently of the instructions being executed. In essence, the associative crossbar is self directed. In the preferred embodiment the system is capable of a parallel issue of up to eight operations per cycle.

Another important advantage of this system is that it allows for more intelligent compilers. Two instructions which appear to a hardware decoder (such as in the prior art described above) to be dependent upon each other can be determined by the compiler not to be interdependent. For example, a hardware decoder would not permit two instructions R1+R2 R3 and R3+R5=R6 to be executed in parallel. A compiler, however, can be “intelligent” enough to determine that the second R3 is a previous value of R3, not the one calculated by R1+R2, and therefore allow both instructions to issue at the same time. This allows the software to be more flexible and faster.

Although the foregoing has been a description of the preferred embodiment of the invention, it will be apparent to those of skill in the art the numerous modifications and variations may be made to the invention without departing from the scope as described herein. For example, arbitrary numbers of pipelines, arbitrary numbers of decoders, and different architectures may be employed, yet rely upon the system we have developed. 

1. A method for operating a computing system comprises: fetching a first 256 bit-wide frame of instructions from an instruction memory, the first frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of instructions from the first frame of instructions, wherein the groups of instructions comprise at least one group of instructions and comprise at most eight groups of individual instructions, wherein a group of instructions are issued separately from other groups of instructions within the first frame of instructions, wherein groups of instructions are issued from left-to-right from the first frame of instructions, and wherein instructions within a group of instructions are issued in parallel; issuing instructions in a first group of instructions from the first frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the first frame of instructions; fetching a second 256 bit-wide frame of instructions from the instruction memory, the second frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of instructions from the second frame of instructions, wherein the groups of instructions comprise at least one group of instructions and comprise at most eight groups of individual instructions, wherein a group of instructions are issued separately from other groups of instructions within the second frame of instructions, wherein groups of instructions are issued from left-to-right from the second frame of instructions, and wherein instructions within a group of instructions are issued in parallel; and issuing instructions in a first group of instructions from the second frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the second frame of instructions; wherein instructions from the first 256 bit-wide frame of instructions are issued before fetching the second 256 bit-wide frame of instructions from the instruction memory; and wherein the grouping bits of the 32 bit-wide instructions from the first frame of instructions and the grouping bits of the 32 bit-wide instructions from the second frame of instructions are specifiable at compile time.
 2. The method of claim 1 wherein the first 256 bit-wide frame of instructions comprises less then eight 32 bit-wide instructions.
 3. The method of claim 1 further comprising: issuing instructions in a second group of instructions from the first frame of instructions to functional units appropriate for the instructions in the second group of instructions in response to grouping bits of the instructions in the second group of instructions and in response to a mapping of the instructions in the second group of instructions to functional units, wherein the mapping is determined in response to a portion of instruction data in each instruction in the second group of instructions from the first frame of instructions.
 4. The method of claim 3 wherein a functional unit appropriate for an instruction in the second group of instructions from the first frame of instruction comprises a floating point unit.
 5. The method of claim 4 wherein the second group of instructions from the first frame of instructions includes a floating point instruction.
 6. The method of claim 1 wherein the first 256 bit-wide frame of instructions comprises exactly eight 32 bit-wide instructions.
 7. The method of claim 6 further comprising: issuing instructions in a second group of instructions from the second frame of instructions to functional units appropriate for the instructions in the second group of instructions in response to grouping bits of the instructions in the second group of instructions and in response to a mapping of the instructions in the second group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the second group of instructions from the second frame of instructions.
 8. The method of claim 1 wherein three groups of instructions are packed within the first 256 bit-wide frame of instructions thereby reducing instruction code size.
 9. The method of claim 8 wherein issuing instructions in a first group of instructions from the first frame of instructions further comprises decoding the instructions in the first group of instructions before issuance to functional units appropriate for the instructions in the first group of instructions from the first frame of instructions.
 10. The method of claim 1 wherein four groups of instructions are packed within the first 256 bit-wide frame of instructions thereby reducing a number of no-operations within the first 256 bit-wide frame of instructions.
 11. The method of claim 10 wherein groups of instructions are not split across the first 256 bit-wide frame of instructions and the second 256 bit-wide frame of instructions.
 12. The method of claim 10 wherein the grouping bits of the 32 bit-wide instructions from the first frame of instructions and the grouping bits of the 32 bit-wide instructions from the second frame of instructions are specified at compile time in response to data dependency checking of the instructions in the first frame of instructions and in response to data dependency checking of the instructions in the second frame of instructions.
 13. The method of claim 1 wherein the instructions in the first instruction frame are stored in little-endian format.
 14. The method of claim 13 wherein the functional units appropriate for the instructions in the first group of instructions in the first frame of instructions are selected from a group of eight functional units.
 15. The method of claim 1 wherein the groups of instructions from the first frame of instructions comprise the first group of instructions, a second group of instructions, and a third group of instructions; wherein instructions grouped as the second group of instructions are to be issued in parallel to appropriate functional units before instructions grouped as the third group of instructions are to be issued in parallel.
 16. The method of claim 15 wherein the first group of instructions comprises two instructions to be issued in parallel; wherein the second group of instructions comprises three instructions to be issued in parallel; and wherein the third group of instructions comprises three instructions to be issued in parallel.
 17. The method of claim 15 wherein the groups of instructions from the first frame of instructions also comprise a fourth group of instructions; wherein instructions grouped as the third group of instructions are to be issued in parallel to appropriate functional units before instructions grouped as the fourth group of instructions are to be issued in parallel; wherein the third group of instructions comprises two instructions to be issued in parallel; and wherein the fourth group of instructions comprises two instructions to be issued in parallel.
 18. The method of claim 1 wherein the first group of instructions from the first frame of instructions includes two add instructions that are issued in parallel to functional units appropriate for the two add instructions.
 19. The method of claim 18 wherein the functional units include two arithmetic logic units.
 20. The method of claim 18 wherein the first group of instructions from the first frame of instructions also includes a load instruction.
 21. The method of claim 1 wherein an instruction in the first group of instructions from the first frame of instructions operates upon registers.
 22. The method of claim 21 wherein an instructions from the first frame of instructions comprises a branch instruction.
 23. A processor comprises: a plurality of functional units; an instruction memory configured to store a first 256-bit wide frame of instructions, the first frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of variable length groups of instructions from the first frame of instructions, wherein the variable length groups of instructions comprise at least one group of instructions and comprise at most eight groups of individual instructions, wherein a group of instructions are dispatched separately from other groups of instructions within the first frame of instructions, wherein groups of instructions are dispatched from left-to-right from the first frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; and an instruction dispatching unit coupled to the instruction memory and the plurality of functional units, the instruction dispatching unit configured to dispatch instructions in a first group of instructions from the first frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the first frame of instructions; and wherein the grouping bits of the 32 bit-wide instructions from the first frame of instructions are determinable at compile time.
 24. The processor of claim 23 wherein the instruction memory is also configured to store a second 256 bit-wide frame of instructions, the second frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of variable length groups of instructions from the second frame of instructions, wherein the variable length groups of instructions comprise at least one group of instructions and comprise at most eight groups of individual instructions, wherein a group of instructions are dispatched separately from other groups of instructions within the second frame of instructions, wherein groups of instructions are dispatched from left-to-right from the second frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; wherein the instruction dispatching unit is also configured to dispatch instructions in a first group of instructions from the second frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the second frame of instructions; and wherein the first group of instructions from the first 256-bit wide frame of instructions are dispatched before the first group of instruction in the second 256 bit-wide frame of instructions.
 25. The processor of claim 24 wherein the instruction dispatching unit is also configured to dispatch instructions in a second group of instructions from the first frame of instructions to functional units appropriate for the instructions in the second group of instructions in response to grouping bits of the instructions in the second group of instructions and in response to a mapping of the instructions in the second group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the second group of instructions from the first frame of instructions.
 26. The processor of claim 25 wherein the first 256 bit-wide frame of instructions comprises less than eight 32 bit-wide instructions and a no operation.
 27. The processor of claim 23 wherein the plurality of functional units comprises a functional unit configured to perform floating-point operations.
 28. The processor of claim 27 wherein an instruction in the first frame of instructions comprises a floating point instruction.
 29. The processor of claim 23 wherein the plurality of functional units also comprises a functional unit configured to perform a load operation and a store operation.
 30. The processor of claim 29 wherein the plurality of functional units also comprises a functional unit configured to perform branch instructions.
 31. The processor of claim 30 wherein the first 256 bit-wide frame of instructions comprises exactly eight 32 bit-wide instructions.
 32. The processor of claim 23 wherein at least three groups of instructions are packed within the first 256 bit-wide frame of instructions thereby saving memory space.
 33. The processor of claim 32 wherein the instruction dispatching unit is also configured to fetch the first frame of instructions and configured to decode the instructions in the first group of instructions before dispatch to functional units appropriate for the instructions in the first group of instructions from the first frame of instructions.
 34. The processor of claim 23 wherein groups of instructions to be dispatched in parallel are not split across frames of instructions.
 35. The processor of claim 34 wherein four groups of instructions are packed within the first 256 bit-wide frame of instructions thereby reducing memory bandwidth.
 36. The processor of claim 34 wherein the grouping bits of the 32 bit-wide instructions from the first frame of instructions are determined at compile time in response to data dependency checking of the instructions in the first frame of instructions.
 37. The processor of claim 23 wherein the functional units appropriate for the instructions in the first group of instructions in the first frame of instructions are selected from a group of eight functional units.
 38. The processor of claim 37 wherein the instructions in the first instruction frame are stored in little-endian format.
 39. The processor of claim 23 wherein the groups of instructions from the first frame of instructions comprise the first group of instructions, a second group of instructions, and a third group of instructions; wherein the instruction dispatching unit is also configured to dispatch instructions in a second group of instructions from the first frame of instructions to functional units appropriate for the instructions in the second group of instructions in response to grouping bits of the instructions in the second group of instructions and in response to a mapping of the instructions in the second group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the second group of instructions from the first frame of instructions; and wherein the instruction dispatching unit is also configured to dispatch instructions grouped as the first group of instructions in parallel to appropriate functional units before dispatching instructions grouped as the second group of instructions in parallel.
 40. The processor of claim 39 wherein the first group of instructions comprises two instructions to be dispatched in parallel; wherein the second group of instructions comprises three instructions to be dispatched in parallel; and wherein the third group of instructions comprises three instructions to be dispatched in parallel.
 41. The processor of claim 39 wherein the groups of instructions from the first frame of instructions also comprise a fourth group of instructions; wherein the instruction dispatching unit is also configured to dispatch instructions in a third group of instructions from the first frame of instructions to functional units appropriate for the instructions in the third group of instructions in response to grouping bits of the instructions in the third group of instructions and in response to a mapping of the instructions in the third group of instructions to functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the third group of instructions from the first frame of instructions; wherein the instruction dispatching unit is also configured to dispatch instructions grouped as the second group of instructions in parallel to appropriate functional units before dispatching instructions grouped as the third group of instructions in parallel; wherein the third group of instructions comprises two instructions to be dispatched in parallel; and wherein the fourth group of instructions comprises two instructions to be dispatched in parallel.
 42. The processor of claim 23 wherein the plurality of functional units include functional units configured to perform arithmetic and logic operations.
 43. The processor of claim 42 wherein an instruction of the first group of instructions from the first frame of instructions comprises a load instruction.
 44. The processor of claim 42 wherein the instructions of the first group from the first frame of instructions comprises two addition instructions.
 45. The processor of claim 42 wherein at least one instruction in the first group of instructions from the first frame of instructions operates upon registers.
 46. The processor of claim 42 wherein an instruction from the first frame of instructions comprises a branch instruction.
 47. An apparatus comprises: a memory configured to store a plurality of instruction data; and a processor coupled to the memory comprising: a memory controller configured to receive a first set of instruction data from the memory; a plurality of functional units; an instruction memory configured to store a first 256-bit wide frame of instructions in response to the first set of instruction data from the memory, the first frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of instructions of variable lengths from the first frame of instructions, wherein the groups of instructions comprise at least one group of instructions and comprise at most eight groups of instructions, wherein a number of instructions in the groups of instructions comprises at least one instruction and up to eight instructions, wherein a group of instructions are dispatched separately from other groups of instructions within the first frame of instructions, wherein groups of instructions are dispatched from left-to-right from the first frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; and an instruction dispatching unit coupled to the instruction memory and coupled to the plurality of functional units, the instruction dispatching unit configured to fetch the first frame of instructions from the instruction memory and configured to dispatch instructions in a first group of instructions from the first frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to appropriate functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the first frame of instructions; wherein the grouping bits of the instructions in the first group of instructions from the first frame of instructions are determinable at compile time.
 48. The apparatus of claim 47 wherein the memory controller is configured to receive a second set of instruction data from the memory; wherein the instruction memory is also configured to store a second 256-bit wide frame of instructions in response to the second set of instruction data from the memory, the second frame of instructions comprising up to eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of instructions of variable lengths from the second frame of instructions, wherein the groups of instructions comprise at least one group of instructions and comprise at most eight groups of instructions, wherein a number of instructions in the groups of instructions comprises at least one instruction and up to eight instructions, wherein a group of instructions are dispatched separately from other groups of instructions within the second frame of instructions, wherein groups of instructions are dispatched from left-to-right from the first frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; and wherein the instruction dispatching unit is also configured to fetch the second frame of instructions from the instruction memory and configured to dispatch instructions in a first group of instructions from the second frame of instructions to functional units appropriate for the instructions in the first group of instructions in response to grouping bits of the instructions in the first group of instructions and in response to a mapping of the instructions in the first group of instructions to appropriate functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the second frame of instructions; wherein the grouping bits of the instructions in the first group of instructions from the first 256-bit wide frame of instructions and the grouping bits of the instructions in the first group of instructions from the second 256 bit-wide frame of instructions are determined at compile time.
 49. The apparatus of claim 48 wherein the instruction dispatching unit is also configured to dispatch instructions in a second group of instructions from the first frame of instructions to functional units appropriate for the instructions in the second group of instructions in response to grouping bits of the instructions in the second group of instructions and in response to a mapping of the instructions in the second group of instructions to appropriate functional units, wherein the mapping is determined in response to at least a portion of instruction data in each instruction in the second group of instructions from the first frame of instructions.
 50. The apparatus of claim 48 wherein the first 256 bit-wide frame of instructions comprises a no operation.
 51. The apparatus of claim 47 wherein the plurality of functional units comprise eight functional units including a floating-point unit.
 52. The apparatus of claim 51 wherein an instruction in a group of instructions from the first frame of instructions comprises a floating point instruction.
 53. The apparatus of claim 52 wherein the plurality of functional units also includes a functional unit configured to perform a load operation.
 54. The apparatus of claim 51 wherein the plurality of functional units also includes a branch unit.
 55. The apparatus of claim 54 wherein the first 256 bit-wide frame of instructions comprises exactly eight 32 bit-wide instructions.
 56. The apparatus of claim 47 wherein more than two groups of instructions are packed within the first 256 bit-wide frame of instructions thereby reducing instruction code size.
 57. The apparatus of claim 56 wherein the instruction dispatching unit is also configured to decode the instructions in the first group of instructions before dispatch to the appropriate functional units.
 58. The apparatus of claim 57 wherein groups of instructions to be dispatched in parallel are not split across frames of instructions.
 59. The apparatus of claim 56 wherein the grouping bits of the instructions in the first group of instructions from the first frame of instructions are specified at compile time in response to data dependency checking of the instructions in the first group of instructions from the first frame of instructions.
 60. The apparatus of claim 56 wherein the instructions in the first instruction frame are stored in little-endian format.
 61. The apparatus of claim 47 wherein the groups of instructions from the first frame of instructions comprise the first group of instructions, a second group of instructions, and a third group of instructions; and wherein a number of instructions in the first group of instructions is different from a number of instructions in the second group of instructions.
 62. The apparatus of claim 61 wherein the groups of instructions from the first frame of instructions also comprise a fourth group of instructions; and wherein a number of instructions in the first group of instructions is different from a number of instructions in the fourth group of instructions.
 63. The apparatus of claim 61 wherein the plurality of functional units includes at least one arithmetic logic unit.
 64. The apparatus of claim 42 wherein the plurality of functional units includes at least two arithmetic logic units; and wherein the first group of instructions from the first frame of instructions comprises two addition instructions.
 65. The apparatus of claim 64 wherein the first group of instructions from the first frame of instructions also comprise a load instruction.
 66. The apparatus of claim 65 wherein the two addition instructions operate upon registers.
 67. The apparatus of claim 47 wherein a number of instructions in the first group of instructions is equal to a number of instructions in the second group of instructions.
 68. The apparatus of claim 67 wherein the number of instructions in the first group of instructions is exactly one instruction.
 69. The apparatus of claim 47 wherein the right-most instruction in the first frame of instructions is configured to store a branch operation.
 70. An instruction memory comprises: a first 256-bit wide frame of instructions comprising eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of variable numbers of instructions from the first frame of instructions, wherein the first frame of instructions comprise at least one group of instructions and comprise at most eight groups of instructions, wherein a number of instructions in the groups of instructions comprises at least one instruction and up to eight instructions, wherein a group of instructions are dispatched serially from left-to-right within the first frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; and a second 256 bit wide frame of instructions comprising eight 32 bit-wide instructions, each 32-bit wide instruction comprising 31 contiguous bits of instruction data and a one bit wide grouping bit, wherein grouping bits of the 32 bit-wide instructions are indicative of groups of variable numbers of instructions from the second frame of instructions, wherein the second frame of instructions comprise at least one group of instructions and comprise at most eight groups of instructions, wherein a number of instructions in the groups of instructions comprises at least one instruction and up to eight instructions, wherein a group of instructions are dispatched serially from left-to-right within the second frame of instructions, and wherein instructions within a group of instructions are dispatched in parallel; wherein a first group of instructions from the first frame of instructions are dispatched to functional units appropriate for instructions in the first group in response to grouping bits of the instructions in the first group of instructions; wherein a second group of instructions from the first frame of instructions are dispatched to functional units appropriate for instructions in the second group in response to grouping bits of the instructions in the second group of instructions; wherein a first group of instructions from the second frame of instructions are dispatched to functional units appropriate for instructions in the first group in response to grouping bits of the instructions in the first group of instructions from the second frame of instructions; and wherein the grouping bits of the instructions in the first frame of instructions and the grouping bits of the instructions in the second frame of instructions are determined at a time other than run-time.
 71. The instruction memory of claim 70 wherein the first group of instructions from the second frame of instructions are dispatched only after all instructions in the first frame of instructions are dispatched.
 72. The instruction memory of claim 71 wherein the grouping bits of the instructions from the first frame of instructions and the first group grouping bits of the instructions from the second frame of instructions are determined at compile time.
 73. The instruction memory of claim 72 wherein the first group of instructions from the first frame of instructions are dispatched in response to a mapping of the instructions in the first group of instructions to appropriate functional units; and wherein the mapping of the instructions is determined in response to at least a portion of instruction data in each instruction in the first group of instructions from the first frame of instructions.
 74. The instruction memory of claim 72 wherein an instruction in the first frame of instructions comprises a no-op instruction.
 75. The instruction memory of claim 70 wherein functional units appropriate for instructions in the first group of instructions in the first frame of instructions comprise eight functional units.
 76. The instruction memory of claim 75 wherein a functional unit appropriate for an instruction in the first frame of instructions comprises a floating point unit.
 77. The instruction memory of claim 76 wherein an instruction in the first frame of instructions is sent to a functional unit that performs a store operation.
 78. The instruction memory of claim 76 wherein a functional unit appropriate for an instruction in the first frame of instructions comprises an arithmetic logic unit.
 79. The instruction memory of claim 78 wherein instructions in the first group of instructions from the first frame of instructions comprise two ALU instructions.
 80. The instruction memory of claim 79 wherein an instruction in the second group of instructions from the first frame of instructions comprises a floating point instruction.
 81. The instruction memory of claim 80 wherein an instruction from the first frame of instructions comprises a branch instruction.
 82. The instruction memory of claim 70 wherein more than two groups of instructions are packed within the first 256 bit-wide frame of instructions thereby reducing instruction code size.
 83. The instruction memory of claim 82 wherein the instructions in the first group of instructions are decoded prior to dispatch to the appropriate functional units.
 84. The instruction memory of claim 83 wherein the instructions in the first group of instructions in the first frame of instructions are checked for data dependency at compile time.
 85. The instruction memory of claim 83 wherein instructions stored in the first frame of instructions and stored in the second frame of instructions are not grouped into a single group of instructions.
 86. The instruction memory of claim 82 wherein the instructions in the first instruction frame and the instructions in the second instruction are stored in little-endian format.
 87. The instruction memory of claim 70 wherein the first group of instructions and the second group of instructions are packed into the first 256 bit-wide frame of instructions to reduce a number of no-operations in the first 256 bit-wide frame of instructions.
 88. The instruction memory of claim 87 wherein a number of instructions in the first group of instructions is identical to a number of instructions in the second group of instructions.
 89. The instruction memory of claim 88 wherein the first frame of instructions also comprise a third group of instructions; and wherein a number of instructions in the third group of instructions comprises more than one instruction.
 90. The instruction memory of claim 89 wherein an instruction in the first group of instructions from the first frame of instruction specifies at least one source register and one destination register. 